Technical Reports on Mathematical and Computing Sciences: TR-CXXX title: Algorithmic Aspects of Boosting
نویسنده
چکیده
We discuss algorithmic aspects of boosting techniques, such as Majority Vote Boosting [Fre95], AdaBoost [FS97], and MadaBoost [DW00a]. Considering a situation where we are given a huge amount of examples and asked to find some rule for explaining these example data, we show some reasonable algorithmic approaches for dealing with such a huge dataset by boosting techniques. Through this example, we explain how to use and how to implement “adaptivity” for scaling-up existing algorithms.
منابع مشابه
Technical Reports on Mathematical and Computing Sciences: Tr-c133 Title: a Modiication of Adaboost: a Preliminary Report Author
In this note, we discuss the boosting algorithm AdaBoost and identify two of its main drawbacks: it cannot be used in the boosting by ltering framework and it is not noise resistant. In order to solve them, we propose a modiication of the weighting system of AdaBoost. We prove that the new algorithm is in fact a boosting algorithm under the condition that the sequence of advantages generated by...
متن کاملon Mathematical and Computing Sciences : TR - C 138 title : MadaBoost : A modification of
In the last decade, one of the research topics that has received a great deal of attention from the machine learning and computational learning communities has been the so called boosting techniques. In this paper, we further explore this topic by proposing a new boosting algorithm that mends some of the problems that have been detected in the, so far most successful boosting algorithm, AdaBoos...
متن کاملTechnical Reports on Mathematical and Computing Sciences: TR-C184
Based on a variation of the pigeon hole principle, we propose a propositional formula having a unique satisfying assignment and prove an exponential lower bound for computing each bit of its satisfying by the tree-like resolution. Our proof is obtained by following the outline proposed by Ben-Sasson and Wigderson [BW99].
متن کاملTechnical Reports on Mathematical and Computing Sciences : TR - C 209 title : Hausdorff Dimension and the Stochastic Traveling Salesman Problem
The traveling salesman problem is a problem of finding the shortest tour through given points. In 1959, Beardwood, Halton, and Hammersley studied asymptotic length of the shortest tour through points on Euclidean space. In particular they described the optimal tour length with Euclidean dimension for the case that points are distributed with respect to Lebesgue absolutely continuous measure. In...
متن کاملTechnical Reports on Mathematical and Computing Sciences: Tr-c124 Title: a Role of Constraint in Self-organization Authors
In this paper we introduce a neural network model of self-organization. This model uses a variation of Hebb rule for updating its synaptic weights, and surely converges to the equilibrium status. The key point of the convergence is the update rule that constrains the total synaptic weight and this seems to make the model stable. We investigate the role of the constraint and show that it is the ...
متن کامل